#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#define in read()
#define rep(i, x, y) for(int i = (x); i <= (y); ++i)
#define per(i, x, y) for(int i = (x); i >= (y); --i)

using namespace std;

typedef long long ll;

inline int read() {
    int x = 0; bool f = 0; char ch = getchar(); while(!isdigit(ch) && ch != EOF) f |= ch == '-',ch = getchar();
    while(isdigit(ch)) x = x * 10 + (ch ^ 48),ch = getchar(); return f ? -x : x;
}

const int N = 26;
const int mod = 1e9 + 7;

int f[(1 << N) + 10], g[N + 10], U, n, m;
short lg[(1 << N) + 10];

inline int upd(const int &x) { return x + (x >> 31 & mod); }

int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
#endif
    n = in, m = in; int u, v; rep(i, 1, m) u = in, v = in, g[u] |= 1 << v, g[v] |= 1 << u;
	U = 1 << n; U--;
	rep(i, 0, n - 1) g[i] |= 1 << i, g[i] = U ^ g[i];
	int ans = 0;
	rep(s, 1, U) {
		int x = s & -s;
		if(x == s) f[s] = 1;
		else {
			f[s] = upd(f[s ^ x] + f[x] - mod);
			f[s] = upd(f[s] + f[g[__builtin_ctz(x)] & s] - mod);
		} 
	}
	per(s, U, 0) ans = upd(ans * 233ll % mod + f[s] + 1 - mod); cout << ans << endl; return 0;
}
